The Equivalence between Enumerating Cyclically Symmetric, Self-Complementary and Totally Symmetric, Self-Complementary Plane Partitions
نویسندگان
چکیده
منابع مشابه
The Equivalence between Enumerating Cyclically Symmetric, Self-Complementary and Totally Symmetric, Self-Complementary Plane Partitions
We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side 2n equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube, without explicitly evaluating either of these numbers. This appears to be the first direct proof of this fact. The problem of finding such a proof was suggested b...
متن کاملTotally Symmetric Self-Complementary Plane Partitions and Alternating Sign Matrices
We present multiresidue integral formulae for partial sums in the basis of link patterns of the polynomial solution to the level 1 Uq(ŝl2) quantum Knizhnik–Zamolodchikov equation at generic values of the quantum parameter q. These allow for rewriting and generalizing a recent conjecture [Di Francesco ’06] connecting the above to generating polynomials for weighted Totally Symmetric Self-Complem...
متن کاملA direct bijection between permutations and a subclass of totally symmetric self- complementary plane partitions
We define a subclass of totally symmetric self-complementary plane partitions (TSSCPPs) which we show is in direct bijection with permutation matrices. This bijection maps the inversion number of the permutation, the position of the 1 in the last column, and the position of the 1 in the last row to natural statistics on these TSSCPPs. We also discuss the possible extension of this approach to f...
متن کاملA Connection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions
We give a lattice path interpretation for totally symmetric self-complementary plane partitions. This is a first step in solving the long standing problem of enumerating such plane partitions. Another outstanding problem in enumerative combinatorics is the search for a bijection between alternating sign matrices and totally symmetric self-complementary plane partitions. From the lattice path in...
متن کاملDeterminant Identities and a Generalization of the Number of Totally Symmetric Self-complementary Plane Partitions
We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17–27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the determinant that gives the number of all totally symmetric self-complementary plane partitions contained in a (2n)×(2n)×(2n) box and that was used by Andrews (J...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1999
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2922